MATHEMATICAL ENGINEERING TECHNICAL REPORTS Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
نویسندگان
چکیده
We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques defined by Shibata[23] and clarify their relation to endpoints of clique trees. Next we define a symmetric binary relation between the set of clique trees and the set of perfect sequences of maximal cliques. We describe the relation as a bipartite graph and prove that the bipartite graph is always connected. Lastly we consider to characterize chordal graphs from the aspect of non-uniqueness of clique trees.
منابع مشابه
Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques de ned by Shibata[23] and clarify their relation to endpoints of clique trees. Next we de ne a symmetric binary relation between the set of clique trees and the set of perfect sequences of maximal cliques. We describe the relation as ...
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملComputing a clique tree with algorithm MLS (Maximal Label Search)
Algorithm MLS (Maximal Label Search) is a graph search algorithm which generalizes algorithmsMCS, LexBFS, LexDFS andMNS. On a chordal graph, MLS computes a peo (perfect elimination ordering) of the graph. We show how algorithm MLS can be modified to compute a pmo (perfect moplex ordering) as well as a clique tree and the minimal separators of a chordal graph. We give a necessary and sufficient ...
متن کاملHierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3
A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A k-clique-colouring of a graph is a colouring of the vertices with at most k colours such that no clique is monochromatic. Défossez proved that the 2-cliquecolouring of perfect graphs is a Σ2 -complete problem [J. Graph Theory 62 (2009) 139–156]. We strengthen this result by showing that it is st...
متن کاملComputing a Clique Tree with the Algorithm Maximal Label Search
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (MNS). On a chordal graph, MLS computes a PEO (perfect elimination ordering) of the graph. We show how the algorithm MLS can be modified to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006